#include <iostream>

using namespace std;

typedef long long LL;

LL a, b, p;

//快速幂模版
LL qpow(LL a, LL b, LL p)
{
	LL ret = 1;
	while(b)
	{
		if(b & 1) ret = ret * a % p;
		a = a * a % p;
		b >>= 1;
	}

	return ret;
}

int main()
{
	cin >> a >> b >> p;

	printf("%lld^%lld mod %lld=%lld\n", a, b, p, qpow(a, b, p));

	return 0;
}

